Solution: Each node of K-ary tree contains at most k nodes. While tree with 2 nodes is called Binary tree and tree with 3 nodes is called Ternary tree.

Solution: Parent node is the node having child nodes and child nodes may contain references to their parents. Parent node is a node connected by a directed edge to its child.

Solution: Depth is defined as the length of the path from root to the node. So the depth of root node in K-ary tree is 0.

Solution: Height of K-ary tree is defined as the length of path from root to deepest node in tree. Therefore, height of root node in K-ary tree is 0.

Solution: Leaf node is a node that has no child. Since Leaf node will always be the node on the last level of k-ary tree, so it can be called child node of given parent node in K-ary tree.

Solution:  Leaf node is any node that does not contain any children. Child node may or may not contain more nodes. Child node will only be called leaf Node if the node has no child node.

Solution:  In the K-ary tree having height h, the upper bound for having maximum number of leaves is k^h.

Solution: Height of a K-ary tree does not include the root node. So the height of the K-ary tree is without root node is 0.

Solution: The parent node for the node of index I in a K-ary tree is given by (I-1)/K.

Solution: Every Full K-ary tree is also a complete K-ary tree. Therefore, both have same number of nodes.